Tournaments for mutual exclusion: verification and concurrent complexity
نویسندگان
چکیده
منابع مشابه
Formal Verification of Distributed Mutual-exclusion Circuits
Distributed mutual-exclusion (DME) circuits are an interesting example of asynchronous circuits. They are composed of identical DME cells connected in a ring of arbitrary size. Each DME cell provides a connection point for one user, and all users compete for exclusive access to a shared resource. This paper reports about formal verification of two well-known DME circuit implementations. Externa...
متن کاملVerification of mutual exclusion algorithms with EST
Mutual exclusion algorithms are a simple and popular example of concurrent systems. We report about the verification of some of them with verification package EST. In the paper we propose modified models for Dekker’s and Peterson’s algorithm which give a compound system without divergent states. For Hyman’s algorithm, we explain why it does not preserve mutual exclusion.
متن کاملA Time Complexity Bound for Adaptive Mutual Exclusion
We consider the time complexity of adaptive mutual exclusion algorithms, where \time" is measured by counting the number of remote memory references required per critical-section access. We establish a lower bound that precludes a deterministic algorithm with O(log k) time complexity (in fact, any deterministic o(k) algorithm), where k is \point contention." In contrast, we show that expected O...
متن کاملTime Complexity Bounds for Shared-memory Mutual Exclusion
YONG-JIK KIM: Time Complexity Bounds for Shared-memory Mutual Exclusion. (Under the direction of James H. Anderson.) Mutual exclusion algorithms are used to resolve conflicting accesses to shared resources by concurrent processes. The problem of designing such an algorithm is widely regarded as one of the “classic” problems in concurrent programming. Recent work on scalable shared-memory mutual...
متن کاملConcurrent SSA Form in the Presence of Mutual Exclusion
Most current compiler analysis techniques are unable to cope with the semantics introduced by explicit parallel and synchronization constructs in parallel programs. In this paper we propose new analysis and optimization techniques for compiling explicitly parallel programs that use mutual exclusion synchronization. We introduce the CSSAME form, an extension of the Concurrent Static Single Assig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formal Aspects of Computing
سال: 2017
ISSN: 0934-5043,1433-299X
DOI: 10.1007/s00165-016-0407-x